Evolving Simple Art-Based Games
نویسندگان
چکیده
Evolutionary art has a long and distinguished history, and genetic programming is one of only a handful of AI techniques which is used in graphic design and the visual arts. A recent trend in so-called ‘new media’ art is to design online pieces which are dynamic and have an element of interaction and sometimes simple game-playing aspects. This defines the challenge addressed here: to automatically evolve dynamic, interactive art pieces with game elements. We do this by extending the Avera user-driven evolutionary art system to produce programs which generate spirograph-style images by repeatedly placing, scaling, rotating and colouring geometric objects such as squares and circles. Such images are produced in an inherently causal way which provides the dynamic element to the pieces. We further extend the system to produce programs which react to mouse clicks, and to evolve sequential patterns of clicks for the user to uncover. We wrap the programs in a simple front end which provides the user with feedback on how close they are to uncovering the pattern, adding a lightweight game-playing element to the pieces. The evolved interactive artworks are a preliminary step in the creation of more sophisticated multimedia pieces.
منابع مشابه
Artificial Life Techniques for Generating Controllers for Physically Modelled Characters
The realistic physical modelling of characters in games and virtual worlds is becoming a viable alternative to more traditional animation techniques. Physical modelling can enhance realism and allow users to interact with the world much more freely. However, designing controllers to move physically modelled characters (e.g. to make a human character walk) is generally a difficult task. Artifici...
متن کاملSimple Search Methods for Finding a Nash Equilibrium
We present two simple search methods for computing a sample Nash equilibrium in a normal-form game: one for 2player games and one for n-player games. We test these algorithms on many classes of games, and show that they perform well against the state of the art– the Lemke-Howson algorithm for 2-player games, and Simplicial Subdivision and Govindan-Wilson for n-player games.
متن کاملEvolving Behaviour Trees for the Commercial Game DEFCON
Behaviour trees provide the possibility of improving on existing Artificial Intelligence techniques in games by being simple to implement, scalable, able to handle the complexity of games, and modular to improve reusability. This ultimately improves the development process for designing automated game players. We cover here the use of behaviour trees to design and develop an AI-controlled playe...
متن کاملPersonalized and Adaptive Serious Games
Personalization and adaptivity can promote motivated usage, increased user acceptance, and user identi cation in serious games. This applies to heterogeneous user groups in particular, since they can bene t from customized experiences that respond to the individual traits of the players. In the context of games, adaptivity describes the automatic adaptation of game elements, i.e., of content, u...
متن کاملEvolving Cooperating Agents Using Team-Based Fitness Assessment
One application of evolutionary computation is developing agents which play in team-based games. In such games, it is often beneficial for each agent in a team to specialise in a different role within the team. We present several methods of evolving such specialisation by assessing agents as members of teams, and compare their performance in evolving solutions to a simulation of an immune syste...
متن کامل